A Lagrange Relaxation Method for Solving Weapon-Target Assignment Problem
نویسندگان
چکیده
We study the weapon-target assignment WTA problem which has wide applications in the area of defense-related operations research. This problem calls for finding a proper assignment of weapons to targets such that the total expected damaged value of the targets to be maximized. The WTA problem can be formulated as a nonlinear integer programming problem which is known to be NP-complete. There does not exist any exact method for the WTA problem even small size problems, although several heuristic methods have been proposed. In this paper, Lagrange relaxation method is proposed for the WTA problem. The method is an iterative approach which is to decompose the Lagrange relaxation into two subproblems, and each subproblem can be easy to solve to optimality based on its specific features. Then, we use the optimal solutions of the two subproblems to update Lagrange multipliers and solve the Lagrange relaxation problem iteratively. Our computational efforts signify that the proposed method is very effective and can find high quality solutions for the WTA problem in reasonable amount of time.
منابع مشابه
Hybrid Nested Partitions method with Intelligent Greedy Search for solving Weapon-Target Assignment Problem
The Weapon-Target Assignment (WTA) problem is one of the most important problems of military applications of operations research. The objective of the WTA problem is to find proper assignments of weapons to targets which minimize the expected damage of defensive side. The WTA problem is known to be NP-complete. In this paper, hybrid Nested Partitions (NP) method is proposed to solve WTA problem...
متن کاملACGA Algorithm of Solving Weapon - Target Assignment Problem
Weapon Target Assignment is not only an important issue to use firepower, but also an important operational decision-making problem. As new intelligent algorithms, Genetic algorithm and ant colony algorithm are applied to solve Weapons-Target Assignment Problem. This paper introduces the Weapon-Target Assignment (WTA) and the mathematical model, and proposes ACGA algorithm which is the integrat...
متن کاملSemidefinite Programming Relaxations for the Quadratic Assignment Problem
Semideenite programming (SDP) relaxations for the quadratic assignment problem (QAP) are derived using the dual of the (homogenized) Lagrangian dual of appropriate equivalent representations of QAP. These relaxations result in the interesting, special, case where only the dual problem of the SDP relaxation has strict interior, i.e. the Slater constraint qualii-cation always fails for the primal...
متن کاملFinding Approximate Solutions for Large Scale Linear Programs
Linear Programming is one of the most frequently applied tools for modeling and solving real world optimization problems. Nonetheless, most commercially available solvers are often incapable of dealing with large problem sizes, e.g. millions of variables or hundreds of thousands of constraints, arising in modern applications. To cope, researchers have applied decomposition methods, in particula...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014